Interval Gauss-Seidel Method for Generalized Solution Sets to Interval Linear Systems
نویسنده
چکیده
In the paper, we advance a numerical technique for enclosing generalized AE-solution sets to interval linear systems. The main result of the paper is an extension of the well-known interval Gauss-Seidel method to the problems of outer estimation of these generalized solution sets. We give a theoretical study of the new method, prove an optimality property for the generalized interval Gauss-Seidel iteration applied to the systems with the interval M-matrices.
منابع مشابه
A New Technique in Systems Analysis Under Interval Uncertainty and Ambiguity
The main subject of this work is mathematical and computational aspects of modeling of static systems under interval uncertainty and/or ambiguity. A cornerstone of the new approach we are advancing in the present paper is, first, the rigorous and consistent use of the logical quantifiers to characterize and distinguish different kinds of interval uncertainty that occur in the course of modeling...
متن کاملA Review of Preconditioners for the Interval Gauss – Seidel Method
Interval Newton methods in conjunction with generalized bisection can form the basis of algorithms that find all real roots within a specified box X ⊂ Rn of a system of nonlinear equations F (X) = 0 with mathematical certainty, even in finite-precision arithmetic. In such methods, the system F (X) = 0 is transformed into a linear interval system 0 = F (M) + F′(X)(X̃ −M); if interval arithmetic i...
متن کاملON THE SOLUTION OF PARAMETRISEDLINEAR SYSTEMSEvgenija
Considered are parametrised linear systems which parameters are subject to tolerances. Rump's xed-point iteration method for nding outer and inner approximations of the hull of the solution set is studied and applied to an electrical circuit problem. Interval Gauss-Seidel iteration for parametrised linear systems is introduced and used for improving the enclosures, obtained by the xed-point met...
متن کاملOn Preconditioners and Splitting in the Interval Gauss–seidel Method
Finding bounding sets to solutions to systems of algebraic equations with uncertainties in the coefficients, as well as finding mathematically rigorous but rapid location of all solutions to nonlinear systems or finding global optima, involves bounding the solution sets to systems of equations with wide interval coefficients. The interval Gauss–Seidel algorithm has various properties that make ...
متن کاملImproving the efficiency of a polynomial system solver via a reordering technique
Methods of interval arithmetic can be used to reliably find with certainty all solutions to nonlinear systems of equations. In such methods, the system is transformed into a linear interval system and a preconditioned interval Gauss-Seidel method may then be used to compute such solution bounds. In this work, a new heuristic for solving polynomial systems is presented, called reordering techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reliable Computing
دوره 7 شماره
صفحات -
تاریخ انتشار 2001